type github.com/andybalholm/brotli.backwardMatch

17 uses

	github.com/andybalholm/brotli (current package)
		backward_references_hq.go#L373: func updateNodes(num_bytes uint, block_start uint, pos uint, ringbuffer []byte, ringbuffer_mask uint, params *encoderParams, max_backward_limit uint, starting_dist_cache []int, num_matches uint, matches []backwardMatch, model *zopfliCostModel, queue *startPosQueue, nodes []zopfliNode) uint {
		backward_references_hq.go#L467: 				var match backwardMatch = matches[j]
		backward_references_hq.go#L573: func zopfliIterate(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint, params *encoderParams, gap uint, dist_cache []int, model *zopfliCostModel, num_matches []uint32, matches []backwardMatch, nodes []zopfliNode) uint {
		backward_references_hq.go#L629: 	var matches [2 * (maxNumMatchesH10 + 64)]backwardMatch
		backward_references_hq.go#L710: 	var matches []backwardMatch = make([]backwardMatch, matches_size)
		backward_references_hq.go#L713: 	var new_array []backwardMatch
		backward_references_hq.go#L733: 			new_array = make([]backwardMatch, new_size)
		h10.go#L74: func storeAndFindMatchesH10(self *h10, data []byte, cur_ix uint, ring_buffer_mask uint, max_length uint, max_backward uint, best_len *uint, matches []backwardMatch) []backwardMatch {
		h10.go#L162: func findAllMatchesH10(handle *h10, dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, cur_ix uint, max_length uint, max_backward uint, gap uint, params *encoderParams, matches []backwardMatch) uint {
		h10.go#L163: 	var orig_matches []backwardMatch = matches
		hash.go#L191: type backwardMatch struct {
		hash.go#L196: func initBackwardMatch(self *backwardMatch, dist uint, len uint) {
		hash.go#L201: func initDictionaryBackwardMatch(self *backwardMatch, dist uint, len uint, len_code uint) {
		hash.go#L212: func backwardMatchLength(self *backwardMatch) uint {
		hash.go#L216: func backwardMatchLengthCode(self *backwardMatch) uint {